منابع مشابه
Bipartizing fullerenes
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O( √ n) edges. This bound is asymptotically optimal.
متن کاملEulerian colorings and the bipartizing matchings conjecture of Fleischner
Fleischner [3] has proposed a novel approach to several deep graph-theoretic conjectures, such as the Cycle Double Cover Conjecture [9,10] or the 5-Flow Conjecture of Tutte [12]. A key ingredient in this approach is the Bipartizing Matchings Conjecture (Conjecture 1.2 below, abbreviated BM Conjecture). In this paper, we introduce the notion of an Eulerian coloring of a trigraph, providing a set...
متن کاملAntigenicity of fullerenes: antibodies specific for fullerenes and their characteristics.
The recent interest in using Buckminsterfullerene (fullerene) derivatives in biological systems raises the possibility of their assay by immunological procedures. This, in turn, leads to the question of the ability of these unprecedented polygonal structures, made up solely of carbon atoms, to induce the production of specific antibodies. Immunization of mice with a C60 fullerene derivative con...
متن کاملMedicinal applications of fullerenes
Fullerenes have attracted considerable attention in different fields of science since their discovery in 1985. Investigations of physical, chemical and biological properties of fullerenes have yielded promising information. It is inferred that size, hydrophobicity, three-dimensionality and electronic configurations make them an appealing subject in medicinal chemistry. Their unique carbon cage ...
متن کاملGenerating Fullerenes at Random
In the present paper a method for generating fullerenes at random is presented. It is based on the well known Stone-Wales (SW) transformation. The method could be further generalised so that other trivalent polyhedra with prescribed properties are generated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2012
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.03.028